#ifndef SQSTACK_H__
#define SQSTACK_H__

#include "avl.h"

#define MAXSIZE 20 //顺序存储的栈最大缺陷在这(扩充不方便)

#define type AVLNode *

typedef struct
{
	type data[MAXSIZE];
	int top;
} sqstack;

sqstack *stack_create(void);

int stack_isempty(sqstack *);

int stack_push(sqstack *, type *);

int stack_pop(sqstack *, type *);

int stack_top(sqstack *st, type *data);

#endif
